منابع مشابه
Tolerance graphs
Tolerance graphs arise from the intersection of intervals with varying tolerances in a way that generalizes both interval graphs and permutation graphs. In this paper we prove that every tolerance graph is perfect by demonstrating that its complement is perfectly orderable. We show that a tolerance graph cannot contain a chordless cycle of length greater than or equal to 5 nor the complement of...
متن کامل(i, J) Competition Graphs
Hefner, K.A.S., K.F. Jones, S. Kim, J.R. Lundgren and F.S. Roberts, (i,j) competition graphs, Discrete Applied Mathematics 32 (1991) 241-262. If D is an acyclic digraph, its competition graph has the same vertex set as D and an edge between vertices x and y if and only if for some vertex u, there are arcs (_q u) and (_Y, u) in D. We study competition graphs of acyclic digraphs D when the indegr...
متن کامل2-Competition Graphs
If D (V, A) is a digraph, its p-competition graph for p a positive integer has vertex set V and an edge between x and y if and only if there are distinct vertices a, , a n in D with (x, a and (y, a) arcs of D for each 1, , p. This notion generalizes the notion of ordinary competition graph, which has been widely studied and is the special case where p 1. Results about the case where p 2 are obt...
متن کاملWeighted Competition Graphs
We introduce a generalization of competition graphs, called weighted competition graphs. The weighted competition graph of a digraph D = (V,A), denoted by Cw(D), is an edge-weighted graph (G,w) such that G = (V,E) is the competition graph of D, and the weight w(e) of an edge e = xy ∈ E is the number of the common preys of x and y in D. We investigate properties of weighted competition graphs.
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(96)80460-4